Strongly minimal Steiner systems II: coordinatization and quasigroups
نویسندگان
چکیده
Each strongly minimal Steiner k-system (M, R) (where is R a ternary collinearity relation) can be ‘coordinatized’ in the sense of (Ganter–Werner 1975) by quasigroup if k prime-power. We show this coordinatization never definable and k-systems constructed (Baldwin–Paolini 2020) interpret quasigroup. Nevertheless, refining construction, prime power, each (2, k)-variety quasigroups (Definition 3.10) there that interprets k-system.
منابع مشابه
On Steiner Quasigroups of Cardinality
In [12] Quackenbush has expected that there should be subdirectly irreducible Steiner quasigroups (squags), whose proper homomorphic images are entropic (medial). The smallest interesting cardinality for such squags is 21. Using the tripling construction given in [1] we construct all possible nonsimple subdirectly irreducible squags of cardinality 21 (SQ(21)s). Consequently, we may say that the...
متن کاملStrongly 2-perfect trail systems and related quasigroups
In a recent paper of the authors the question of for which values of m the quasigroups arising from strongly two 2-perfect m-cycle systems are the finite members of a variety was considered. In comparison with existing results on similar problems, it seems likely that for m prime, we shall fail to get varieties only for those values of m where strongly 2perfect closed m-trail systems which are ...
متن کاملSemi-planar Steiner quasigroups of cardinality 3n
It is well known that for each n ≡ 1 or 3 (mod 6) there is a planar Steiner quasigroup (briefly, squag) of cardinality n (Doyen (1969) and Quackenbush (1976)). A simple squag is semi-planar if every triangle either generates the whole squag or the 9-element subsquag (Quackenbush (1976)). In fact, Quakenbush has stated that there should be such semi-planar squags. In this paper, we construct a s...
متن کاملRepresenting graphs in Steiner triple systems - II
Let G = (V,E) be a simple graph and let T = (P,B) be a Steiner triple system. Let φ be a one-to-one function from V to P . Any edge e = {u, v} has its image {φ(u), φ(v)} in a unique block in B. We also denote this induced function from edges to blocks by φ. We say that T represents G if there exists a one-to-one function φ : V → P such that the induced function φ : E → B is also one-to-one; tha...
متن کاملSteiner Minimal Trees ∗
While a spanning tree spans all vertices of a given graph, a Steiner tree spans a given subset of vertices. In the Steiner minimal tree problem, the vertices are divided into two parts: terminals and nonterminal vertices. The terminals are the given vertices which must be included in the solution. The cost of a Steiner tree is defined as the total edge weight. A Steiner tree may contain some no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebra Universalis
سال: 2023
ISSN: ['0002-5240', '1420-8911']
DOI: https://doi.org/10.1007/s00012-023-00812-w